The point-to-point delivery and connection problems: complexity and algorithms
نویسندگان
چکیده
منابع مشابه
A strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملAsynchronous Organizations for Solving the Point-to-Point Connection Problem
We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is an organization of agents that communicate with each other by means of shared memories....
متن کاملIterative Algorithms Approach to Variational Inequalities and Fixed Point Problems
and Applied Analysis 3 for all x, y ∈ C. A mapping A : C → H is said to be α-inverse strongly g-monotone if and only if 〈 Ax −Ay, g x − gy ≥ α∥Ax −Ay∥2, 2.2 for some α > 0 and for all x, y ∈ C. A mapping g : C → C is said to be strongly monotone if there exists a constant γ > 0 such that 〈 g x − gy, x − y ≥ γ∥x − y∥2, 2.3 for all x, y ∈ C. Let B be a mapping ofH into 2 . The effective domain of...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولA Branch-and-Cut to the Point-to-Point Connection Problem on Multicast Networks∗
In multicast routing, one of the basic problems consists of sending data from a set of sources to a set of destinations with minimum cost. A formalization of this problem using graph theory is given by the nonfixed Point-to-Point Connection (PPC) Problem. The optimization version of this problem is known to be NP-hard, and it can be also applied in areas such as circuit switching and VLSI desig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90258-c